On context-free matrix forms

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derivation Complexity in Context-Free Grammar Forms

Let F be an arbitrary context-free grammar form and (F) the family of grammars defined by F. For each grammar G in d(F), the derivation complexity function 6, on the language of G, is defined for each word x as the number of steps in a minimal G-derivation of x. It is shown that derivations may always be speeded up by any constant factor n, in the sense that for each positive integer n, an equi...

متن کامل

Descriptional Complexity of Context-Free Grammar Forms

Csuhaj-Vajh, E. and A. Kelemenovi, Descriptional complexity of context-free grammar forms, Theoretical Computer Science 112 (1993) 277-289. Descriptional complexity aspects of grammar forms are studied. It is shown that grammatical complexity measures HEI,q, LEV,<, VAR,<, PROD,< and DEP., related to any appropriate infinite class ‘8 of grammars are unbounded on the infinite class of languages d...

متن کامل

Completeness of Context-Free Grammar Forms

The notions of a grammar form and g-interpretation were first introduced in [2]. However, it quickly became apparent, particularly for EOL forms [5], that (strict) interpretations had a wider interest as well as being better motivated mathematically. The study of parsing of grammar forms detailed in [4], the basic investigation in [8] on linear completeness amongst other results, the study of d...

متن کامل

Context-Free Grammars: Covers, Normal Forms, and Parsing

Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd context free grammars covers nor...

متن کامل

Normal forms for linear displacement context-free grammars

In this paper we prove several results on normal forms for linear displacement context-free grammars. The results themselves are rather simple and use well-known techniques, but they are extensively used in more complex constructions. Therefore this article mostly serves educational and referential purposes. 1 Displacement context-free grammars Displacement context-free grammars (DCFGs) are a r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1978

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(78)90829-x